Construction of pseudorandom binary sequences using additive characters over GF(2 k )

نویسنده

  • János Folláth
چکیده

8th Central European Conference on Cryptography 20082

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters

In this paper the randomness of binary sequences generated over elliptic curve is studied. The construction uses multiplicative characters and both the well-distribution and correlation measures are estimated. 2000 Mathematics Subject Classification: Primary 11K45

متن کامل

Construction of large families of pseudo-random binary sequences

In a series of papers Mauduit and S arkozy (partly with coauthors) studied nite pseudorandom binary sequences. They showed that the Legendre symbol forms a \good" pseudorandom sequence, and they also tested other sequences for pseudorandomness, however, no large family of \good" pseudorandom sequences has been found yet. In this paper, a large family of this type is constructed. Again, the con...

متن کامل

Construction of pseudorandom binary lattices using elliptic curves

In an earlier paper Hubert, Mauduit and Sárközy introduced and studied the notion of pseudorandomness of binary lattices. Later constructions were given by using characters and the notion of multiplicative inverse over finite fields. In this paper a further large family of pseudormandom binary lattices is constructed by using elliptic curves. 2000 Mathematics Subject Classification: Primary 11K45

متن کامل

Elliptic Curve Pseudorandom Sequence Generators

In this paper, we introduce a new approach to the generation of binary sequences by applying trace functions to elliptic curves over GF (2). We call these sequences elliptic curve pseudorandom sequences (EC-sequence). We determine their periods, distribution of zeros and ones, and linear spans for a class of EC-sequences generated from supersingular curves. We exhibit a class of EC-sequences wh...

متن کامل

Binary Pseudorandom Sequences of Period 2/sup m/-1 with Ideal Autocorrelation Generated by the Polyn - Information Theory, IEEE Transactions on

In this correspondence, we present a construction for binary pseudorandom sequences of period 2 1 with ideal autocorrelation property using the polynomial z+(z+1). We show that the sequence obtained from the polynomial becomes an m-sequence for certain values of d. We also find a few values of d which yield new binary sequences with ideal autocorrelation property when m is 3k 1, where k is a po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Periodica Mathematica Hungarica

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2008